Efficient and Reliable Self‐Collision Culling Using Unprojected Normal Cones

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient and Reliable Self-Collision Culling Using Unprojected Normal Cones

We present an efficient and accurate algorithm for self-collision detection in deformable models. Our approach can perform discrete and continuous collision queries on triangulated meshes. We present a simple and linear time algorithm to perform the normal cone test using the unprojected 3D vertices, which reduces to a sequence point-plane classification tests. Moreover, we present a hierarchic...

متن کامل

Efficient Occlusion Culling using Solid Occluders

Occlusion culling is a genre of algorithms for rapidly eliminating portions of three-dimensional geometry hidden behind other, visible objects prior to passing them to the rendering pipeline. In this paper, an extension to the popular shadow frustum culling algorithm is presented, which takes into account the fact that many planar occluders can be grouped into compound convex solids, which in t...

متن کامل

Detecting Flat Normal Cones Using Segre Classes

Given a flat, projective morphism Y → T from an equidimensional scheme to a nonsingular curve and a subscheme Z of Y , we give conditions under which specialization of the Segre class s(NZY ) of the normal cone of Z in Y implies flatness of the normal cone. We apply this result to study when the relative tangent star cone of a flat family is flat.

متن کامل

Efficient Conservative Visibility Culling Using the Prioritized-Layered Projection Algorithm

We propose a novel conservative visibility culling technique based on the Prioritized-Layered Projection (PLP) algorithm. PLP is a time-critical rendering technique that computes, for a given viewpoint, a partially correct image by rendering only a subset of the geometric primitives, those that PLP determines to be mostly likely visible. Our new algorithm builds on PLP and provides an efficient...

متن کامل

Normal cones of monomial primes

We explicitly calculate the normal cones of all monomial primes which define the curves of the form (tL, tL+1, . . . , tL+n), where n ≤ 4. All of these normal cones are reduced and Cohen-Macaulay, and their reduction numbers are independent of the reduction. These monomial primes are new examples of integrally closed ideals for which the product with the maximal homogeneous ideal is also integr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Graphics Forum

سال: 2017

ISSN: 0167-7055,1467-8659

DOI: 10.1111/cgf.13095